Physical complexity of symbolic sequences
نویسندگان
چکیده
منابع مشابه
Physical Complexity of Symbolic Sequences
A practical measure for the complexity of sequences of symbols (“strings”) is introduced that is rooted in automata theory but avoids the problems of Kolmogorov–Chaitin complexity. This physical complexity can be estimated for ensembles of sequences, for which it reverts to the difference between the maximal entropy of the ensemble and the actual entropy given the specific environment within wh...
متن کاملPhysical Complexity of Variable Length Symbolic Sequences
A measure called Physical Complexity is established and calculated for a population of sequences, based on statistical physics, automata theory, and information theory. It is a measure of the quantity of information in an organism’s genome. It is based on Shannon’s entropy, measuring the information in a population evolved in its environment, by using entropy to estimate the randomness in the g...
متن کاملOn the Fragmentary Complexity of Symbolic Sequences
A measure of the ability of a symbolic sequence to be coded by initial fragments of another symbolic sequence is introduced and its basic properties are investigated. Applications to the characterization of symbolic sequences associated with shift mappings on a torus corresponding to a special partitioning of the torus and to multi-rate systems of coprocessors are considered. P. Diamond, P. Klo...
متن کاملSimilarity of symbolic sequences
A new numerical characterization of symbolic sequences is proposed. The partition of sequence based on Ke and Tong algorithm is a starting point. Algorithm decomposes original sequence into set of distinct subsequences a patterns. The set of subsequences common for two symbolic sequences (their intersection) is proposed as a measure of similarity between them. The new similarity measure works w...
متن کاملRank and symbolic complexity
We investigate the relation between the complexity function of a sequence, that is the number p(n) of its factors of length n, and the rank of the associated dynamical system, that is the number of Rokhlin towers required to approximate it. We prove that if the rank is one, then lim infn→+∞ p(n) n2 ≤ 1 2 , but give examples with lim supn→+∞ p(n) G(n) = 1 for any prescribed function G with G(n) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica D: Nonlinear Phenomena
سال: 2000
ISSN: 0167-2789
DOI: 10.1016/s0167-2789(99)00179-7